Normal binary graph models

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal Binary Graph Models

We show that the marginal semigroup of a binary graph model is normal if and only if the graph is free of K4 minors. The technique, based on the interplay of normality and the geometry of the marginal cone, has potential applications to other normality questions in algebraic statistics.

متن کامل

Markov Bases of Binary Graph Models

This paper is concerned with the topological invariant of a graph given by the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We describe a degree four Markov basis for the model when the underlying graph is a cycle and generalize this result to the complete bipartite graph K2,n. We also give a combinatorial classification of degree two...

متن کامل

Normal forms for binary relations

We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizing and induces a notion of computable normal form for terms. This notion of reduction thus leads ...

متن کامل

Graph Structured Normal Means Inference

This thesis addresses statistical estimation and testing of signals over a graph when measurements are noisy and high-dimensional. Graph structured patterns appear in applications as diverse as sensor networks, virology in human networks, congestion in internet routers, and advertising in social networks. We will develop asymptotic guarantees of the performance of statistical estimators and tes...

متن کامل

Binary Search and Recursive Graph Problems

A graph G = (V,E) is recursive if every node of G has a finite number of neighbors, and both V and E are recursive (i.e., decidable). We examine the complexity of identifying the number of connected components of an infinite recursive graph, and other related problems, both when an upper bound to that value is given a priori or not. The problems that we deal with are unsolvable, but are recursi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of the Institute of Statistical Mathematics

سال: 2010

ISSN: 0020-3157,1572-9052

DOI: 10.1007/s10463-010-0296-3